The M/M/c with critical jobs
نویسندگان
چکیده
We consider the MIMIc queue, where customers transfer to a critical state when their queueing (sojourn) time exceeds a random time. Lower and upper bounds for the distribution of the number of critical jobs are derived from two modifications of the original system. The two modified systems can be efficiently solved. Numerical calculations indicate the power of the approach.
منابع مشابه
A Non-Preemptive Two-Class M/M/1 System with Prioritized Real-Time Jobs under Earliest-Deadline-First Policy
This paper introduces an analytical method for approximating the performance of a two-class priority M/M/1 system. The system is fully non-preemptive. More specifically, the prioritized class-1 jobs are real-time and served with the non-preemptive earliest-deadline-first (EDF) policy, but despite their priority cannot preempt any non real-time class-2 job. The waiting class-2 jobs can only be s...
متن کاملA Kinetic Comparison on the Inhibition of Adenosine Deaminase by Purine Drugs
The effects of allopurinol, acyclovir and theophylline on the activity of adenosine deaminase (ADA) were studied in 50 mM sodium phosphate buffer pH 7.5 at 27°C, using a UV– Vis spectrophotometer. Adenosine deaminase is inhibited by these ligands, via different types of inhibition. Allopurinol, as a transition state analog of xanthine oxidase, and acyclovir competitively inhibit the catalytic a...
متن کاملA Kinetic Comparison on the Inhibition of Adenosine Deaminase by Purine Drugs
The effects of allopurinol, acyclovir and theophylline on the activity of adenosine deaminase (ADA) were studied in 50 mM sodium phosphate buffer pH 7.5 at 27°C, using a UV– Vis spectrophotometer. Adenosine deaminase is inhibited by these ligands, via different types of inhibition. Allopurinol, as a transition state analog of xanthine oxidase, and acyclovir competitively inhibit the catalytic a...
متن کاملAn Optimum Algorithm for Single Machine with Early/Tardy Cost
The problem of determining the sequence of a set of jobs with the objective function of minimizing the maximum earliness and tardiness in one machine is studied. Production systems like JIT are one of the many applications of the problem. This problem is studied in special cases and their optimal solutions are introduced with simple orders. In general, some effective conditions for neig...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Meth. of OR
دوره 47 شماره
صفحات -
تاریخ انتشار 1998